Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
Identifieur interne : 000051 ( LNCS/Analysis ); précédent : 000050; suivant : 000052Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
Auteurs : Guoqiang Bai [Allemagne] ; Henning Fernau [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2008.
Abstract
Abstract: constraint bipartite vertex cover is a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized algorithm for this problem. This has led to considerable simplifications of the published, quite sophisticated algorithm. Moreover, we can prove that the mentioned algorithm could be quite efficient in practial situations.
Url:
DOI: 10.1007/978-3-540-69311-6_10
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001693
- to stream Istex, to step Curation: 001581
- to stream Istex, to step Checkpoint: 000577
- to stream Main, to step Merge: 001265
- to stream Main, to step Curation: 001163
- to stream Main, to step Exploration: 001163
- to stream LNCS, to step Extraction: 000051
Links to Exploration step
ISTEX:117BD01AE315E38544A1808002A02C13AA8EF8CALe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations</title><author><name sortKey="Bai, Guoqiang" sort="Bai, Guoqiang" uniqKey="Bai G" first="Guoqiang" last="Bai">Guoqiang Bai</name></author><author><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name><affiliation><country>Allemagne</country><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:117BD01AE315E38544A1808002A02C13AA8EF8CA</idno><date when="2008" year="2008">2008</date><idno type="doi">10.1007/978-3-540-69311-6_10</idno><idno type="url">https://api.istex.fr/document/117BD01AE315E38544A1808002A02C13AA8EF8CA/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001693</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001693</idno><idno type="wicri:Area/Istex/Curation">001581</idno><idno type="wicri:Area/Istex/Checkpoint">000577</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000577</idno><idno type="wicri:doubleKey">0302-9743:2008:Bai G:constraint:bipartite:vertex</idno><idno type="wicri:Area/Main/Merge">001265</idno><idno type="wicri:Area/Main/Curation">001163</idno><idno type="wicri:Area/Main/Exploration">001163</idno><idno type="wicri:Area/LNCS/Extraction">000051</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations</title><author><name sortKey="Bai, Guoqiang" sort="Bai, Guoqiang" uniqKey="Bai G" first="Guoqiang" last="Bai">Guoqiang Bai</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Univ. Trier, FB IV—Abteilung Informatik, 54286, Trier</wicri:regionArea><wicri:noRegion>54286, Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion></affiliation><affiliation></affiliation></author><author><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Univ. Trier, FB IV—Abteilung Informatik, 54286, Trier</wicri:regionArea><wicri:noRegion>54286, Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2008</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">117BD01AE315E38544A1808002A02C13AA8EF8CA</idno><idno type="DOI">10.1007/978-3-540-69311-6_10</idno><idno type="ChapterID">10</idno><idno type="ChapterID">Chap10</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: constraint bipartite vertex cover is a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized algorithm for this problem. This has led to considerable simplifications of the published, quite sophisticated algorithm. Moreover, we can prove that the mentioned algorithm could be quite efficient in practial situations.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Rhénanie-Palatinat</li></region><settlement><li>Trèves (Allemagne)</li></settlement><orgName><li>Université de Trèves</li></orgName></list><tree><country name="Allemagne"><noRegion><name sortKey="Bai, Guoqiang" sort="Bai, Guoqiang" uniqKey="Bai G" first="Guoqiang" last="Bai">Guoqiang Bai</name></noRegion><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/LNCS/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000051 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/LNCS/Analysis/biblio.hfd -nk 000051 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= LNCS
|étape= Analysis
|type= RBID
|clé= ISTEX:117BD01AE315E38544A1808002A02C13AA8EF8CA
|texte= Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
}}
| This area was generated with Dilib version V0.6.31. |  |